Constructing Area Voronoi Diagram Based on Direct Calculation of the Freeman Code of Expanded Contours

نویسندگان

  • Yue Lu
  • Chunyun Xiao
  • Chew Lim Tan
چکیده

A Voronoi diagram of image elements provides an intuitive and appealing definition of proximity, which has been suggested as an effective tool for the description of relations among the neighboring objects in a digital image. In this paper, an implementation algorithm based on direct calculation of the Freeman code of expanded contours is proposed for generating area Voronoi diagram of connected components. A closed convex polygon is utilized to bound each connected component, as an approximate representation, and the contour is represented using Freeman chain coding, from which we can compute the corresponding Freeman chain coding of its expanded contour directly, without recourse to the operation on pixels. While the contours iteratively expand outwards, the Voronoi diagram is constructed by the intersections of the expanded contours from different connected components. The experimental results show that our proposed approach significantly improves the speed of constructing area Voronoi diagram in digital images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distinct element modelling of the mechanical behaviour of intact rocks using voronoi tessellation model

This paper aims to study the mechanical behaviour and failure mechanism of intact rocks under different loading conditions using the grain based model implemented in the universal distinct element code (UDEC). The grain based numerical model is a powerful tool to investigate complicated micro-structural mechanical behaviour of rocks. In the UDEC grain based model, the intact material is simulat...

متن کامل

A QTM-based Algorithm for Generation of the Voronoi Diagram on a Sphere

To efficiently store and analyse spatial data at a global scale, the digital expression of the Earth’s data must be global, continuous and conjugate, i.e., a spherical dynamic data model is needed. The Voronoi data structure is the only published attempt and only solution (which is currently available) for dynamic GIS. The complexity of the Voronoi algorithms for line and area data sets in a ve...

متن کامل

Thin-Wall Calculation for Layered Manufacturing

We describe a new algorithm for making partially hollow layered parts with thin, dense walls of approximately uniform thickness, for faster build times and reduced material usage. We have implemented our algorithm and tested its output on a fused deposition modeling (FDM) machine, using separate build volumes for a loosely filled interior and a thin, solid, exterior wall. The build volumes are ...

متن کامل

A provably complete exploration strategy by constructing Voronoi diagrams

We present novel exploration algorithms and a control law that enables the construction of Voronoi diagrams over unknown areas using a single vehicle equipped with range sensors. The control law uses range measurements to make the vehicle track Voronoi edges between obstacles. The exploration algorithms make decisions at vertices in the Voronoi diagram to expand the explored area until a comple...

متن کامل

Critical Area Computation { a New

In this paper we present a new approach for computing the critical area for shorts in a circuit layout. The critical area calculation is the main computational problem in VLSI yield prediction. The method is based on the concept of Voronoi diagrams and computes the critical area for shorts (for all possible defect radii, assuming square defects) accurately in O(n log n) time, where n is the siz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJPRAI

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2007